Cliques in Odd-Minor-Free Graphs
نویسندگان
چکیده
This paper is about: (1) bounds on the number of cliques in a graph in a particular class, and (2) algorithms for listing all cliques in a graph. We present a simple algorithm that lists all cliques in an n-vertex graph in O(n) time per clique. For O(1)-degenerate graphs, such as graphs excluding a fixed minor, we describe a O(n) time algorithm for listing all cliques. We prove that graphs excluding a fixed odd-minor have O(n2) cliques (which is tight), and conclude a O(n3) time algorithm for listing all cliques.
منابع مشابه
8 F eb 2 01 2 Cliques in Odd - Minor - Free Graphs ∗
This paper is about: (1) bounds on the number of cliques in a graph in a particular class, and (2) algorithms for listing all cliques in a graph. We present a simple algorithm that lists all cliques in an n-vertex graph in O(n) time per clique. For O(1)-degenerate graphs, such as graphs excluding a fixed minor, we describe a O(n) time algorithm for listing all cliques. We prove that graphs excl...
متن کاملEven-cycle decompositions of graphs with no odd-K4-minor
An even-cycle decomposition of a graph G is a partition of E(G) into cycles of even length. Evidently, every Eulerian bipartite graph has an even-cycle decomposition. Seymour (1981) proved that every 2-connected loopless Eulerian planar graph with an even number of edges also admits an even-cycle decomposition. Later, Zhang (1994) generalized this to graphs with no K5-minor. Our main theorem gi...
متن کاملTotally odd subdivisions and parity subdivisions: Structures and Coloring
A totally odd H-subdivision means a subdivision of a graph H in which each edge of H corresponds to a path of odd length. Thus this concept is a generalization of a subdivision of H. In this paper, we give a structure theorem for graphs without a fixed graph H as a totally odd subdivision. Namely, every graph with no totally odd H-subdivision has a tree-decomposition such that each piece is eit...
متن کاملHomomorphism bounds and edge-colourings of K4-minor-free graphs
We present a necessary and sufficient condition for a graph of odd-girth 2k + 1 to bound the class of K4-minor-free graphs of odd-girth (at least) 2k + 1, that is, to admit a homomorphism from any such K4-minor-free graph. This yields a polynomial-time algorithm to recognize such bounds. Using this condition, we first prove that every K4-minor free graph of odd-girth 2k+1 admits a homomorphism ...
متن کاملMinimal Diagrams of Free Knots
An irreducibly odd graph is a graph such that each vertex has odd degree and for every pair of vertices, a third vertex in the graph is adjacent to exactly one of the pair. This family of graphs was introduced recently by Manturov [1] in relation to free knots. In this paper, we show that every graph is the induced subgraph of an irreducibly odd graph. Furthermore, we prove that irreducibly odd...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012